Periodic Topology Optimization of a Stacker Crane
نویسندگان
چکیده
منابع مشابه
The stacker crane problem and the directed general routing problem
In this paper we deal with the polyhedral description and the resolution of the Directed General Routing Problem (DGRP) and the Stacker Crane Problem (SCP). The DGRP, in which the service activity occurs both at some of the nodes and at some of the arcs of a directed graph, contains a large number of important arc and node routing problems as special cases, including the SCP. Here, large famili...
متن کاملA Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Given an edge-weighted transportation network G and a list of transportation requests L, the stacker crane problem is to find a minimum-cost tour for a server along the edges of G that serves all requests. The server has capacity one, and starts and stops at the same vertex. In this paper, we consider the case that the transportation network G is a tree, and that the requests are chosen randoml...
متن کاملTopology optimization of periodic microstructure of electromagnetic material
1 Abstract This paper describes a topology optimization method for structures in electromagnetic materials. The material structures that exhibit special characteristics in terms of the repulsion of electromagnetic waves tend to be configured as periodical composite structures built of two or more materials. Generally termed “metamaterials”, these sometimes have especially unusual or even counte...
متن کاملTopology Optimization Based on Structural Flexibility in the Periodic Loading
In structural design, the stiffest structure has been considered optimal. However, if the flexibility is implemented in some appropriate portions, a flexible structure provides higher performance than the stiffest structure. Furthermore, since flexible portions can provide a mechanical function to the structure, a new breed of jointless structural mechanisms known as compliant mechanism can be ...
متن کاملTree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experiment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2960327